Neighbor-finding based on space-filling curves
نویسندگان
چکیده
منابع مشابه
Neighbor-finding based on space-filling curves
Nearest neighbor-finding is one of the most important spatial operations in the field of spatial data structures concerned with proximity. Because the goal of the space-filling curves is to preserve the spatial proximity, the nearest neighbor queries can be handled by these space-filling curves. When data is ordered by the Peano curve, we can directly compute the sequence numbers of the neighbo...
متن کاملEfficient Neighbor-Finding on Space-Filling Curves
Space-filling curves (SFC, also known as FASS-curves) are a useful tool in scientific computing and other areas of computer science to sequentialize multidimensional grids in a cache-efficient and parallelization-friendly way for storage in an array. Many algorithms, for example grid-based numerical PDE solvers, have to access all neighbor cells of each grid cell during a grid traversal. While ...
متن کاملContext-based Space Filling Curves
A context-based scanning technique for images is presented. An image is scanned along a context-based space filling curve that is computed so as to exploit inherent coherence in the image. The resulting one-dimensional representation of the image has improved autocorrelation compared with universal scans such as the PeanoHilbert space filling curve. An efficient algorithm for computing context-...
متن کاملEfficient Nearest Neighbor Indexing Based on a Collection of Space Filling Curves
A database is populated with a set of points represented by n-tuples of real numbers. A query consists of a point q (not necessarily in the database) and an integer k, asking for the k "nearest" database points to the query point. The exact output for the query consists of the k nearest points, but if the database is large and a quick response is required, a good approximate output is sought. A...
متن کاملOn the Quality of Partitions Based on Space-Filling Curves
This paper presents bounds on the quality of partitions induced by space-filling curves. We compare the surface that surrounds an arbitrary index range with the optimal partition in the grid, i. e. the square. It is shown that partitions induced by Lebesgue and Hilbert curves behave about 1.85 times worse with respect to the length of the surface. The Lebesgue indexing gives better results than...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2005
ISSN: 0306-4379
DOI: 10.1016/j.is.2003.12.002